Developing Domain-Independent Search Control for Europa2

نویسندگان

  • Sara Bernardini
  • David E. Smith
چکیده

In the last few years, classical planners have achieved impressive results due to the development of problem relaxation techniques for computing distance estimates. In contrast, many large temporal planning systems used for practical applications have not benefitted from these techniques. Instead, these systems rely on careful engineering of the domain knowledge, together with carefully crafted domaindependent control information. In this paper, we explain some of the characteristics of NASA’s EUROPA2 planning system that make it difficult to directly apply the heuristic techniques developed for classical planning. However, we then borrow ideas from some of these techniques to develop domain-independent heuristic techniques for EUROPA2. We show some promising initial results concerning their effec-

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards Search Control via Dependency Graphs in Europa2

We develop domain-independent search control for NASA’s Europa2 planning system based on the construction of Dependency Graphs, which succinctly represent the dependencies between the activities of a domain. This approach can be generalized to other temporal planners whose performance also relies on careful engineering of the domains and/or handcoded domain-dependent search control information.

متن کامل

Query Architecture Expansion in Web Using Fuzzy Multi Domain Ontology

Due to the increasing web, there are many challenges to establish a general framework for data mining and retrieving structured data from the Web. Creating an ontology is a step towards solving this problem. The ontology raises the main entity and the concept of any data in data mining. In this paper, we tried to propose a method for applying the "meaning" of the search system, But the problem ...

متن کامل

Exploration and Combination: Randomized and Multi-Strategies Search in Satisficing Planning

Heuristic (Informed) Search takes advantage of problemspecific knowledge beyond the definition of the problem itself to find solutions more efficiently than uninformed search, such as Breadth-First Search (BFS) and Depth-First Search (DFS). We design domain-dependent search algorithms to plan tasks. However, the domain-dependent design pattern cannot be applied to fully automatic domains, such ...

متن کامل

Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning

Heuristic search is a leading approach to domain-independent planning. For cost-optimal planning, however, existing admissible heuristics are generally too weak to effectively guide the search. Pattern database heuristics (PDBs), which are based on abstractions of the search space, are currently one of the most promising approaches to developing better admissible heuristics. The informedness of...

متن کامل

A Gravitational Search Algorithm-Based Single-Center of Mass Flocking Control for Tracking Single and Multiple Dynamic Targets for Parabolic Trajectories in Mobile Sensor Networks

Developing optimal flocking control procedure is an essential problem in mobile sensor networks (MSNs). Furthermore, finding the parameters such that the sensors can reach to the target in an appropriate time is an important issue. This paper offers an optimization approach based on metaheuristic methods for flocking control in MSNs to follow a target. We develop a non-differentiable optimizati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007